Multiuser Optimization: Distributed Algorithms and Error Analysis
نویسندگان
چکیده
منابع مشابه
Multiuser Optimization: Distributed Algorithms and Error Analysis
Traditionally, a multiuser problem is a constrained optimization problem characterized by a set of users, an objective given by a sum of user-specific utility functions, and a collection of linear constraints that couple the user decisions. The users do not share the information about their utilities, but do communicate values of their decision variables. The multiuser problem is to maximize th...
متن کاملAnalysis of Algorithms for Distributed Optimization
Gradient descent (GD) and coordinate descent (CD) are two competing families of optimization algorithms used to solve numerous machine learning tasks. The proliferation of large, web-scale datasets has led researchers to investigate minibatch variants of these algorithms in parallel and distributed settings. However, there is a lack of consensus in the community about the relative merits of the...
متن کاملError analysis and performance optimization of fast hierarchical backprojection algorithms
We recently proposed a novel fast backprojection algorithm for reconstruction of an N x N pixel object from O(N) projections in O(N(2)log(2)N) operations. In this paper, we analyze a simplified version of that algorithm, to determine the effects of various parameter choices on the algorithm's theoretical performance. We derive a bound on the variance of the per-pixel error introduced by using h...
متن کاملFixed point error analysis of multiuser detection and synchronization algorithms for CDMA communication systems
Conventional correlation based single-user techniques for Direct Sequence Code Division Multiple Access (DS-CDMA) wireless communication systems are susceptible to performance degradation due to interference from other users. Recent research has focused on development of several multiuser techniques where information about multiple users is used to improve performance for each individual user. ...
متن کاملFrom geometric optimization and nonsmooth analysis to distributed coordination algorithms
We investigate the coordination of groups of autonomous robots performing spatially-distributed sensing tasks. We present facility location functions from geometric optimization and study their differentiable properties. We then design distributed coordination algorithms and analyze them as nonsmooth gradient flows. The resulting control laws correspond to basic interaction behaviors between th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2011
ISSN: 1052-6234,1095-7189
DOI: 10.1137/090770102